Subspace SNR Maximization: The Constrained Stochastic Matched Filter

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SNR Maximization at CSI Aware AF Relay

This paper concerns two-hop communication over relay-assisted Block fading channel. It is assumed there is not a direct link between the transmitter and the affiliated destination and the communication occurs in two hops through the use of a relay, where the amplify and forward (AF) strategy is employed at this node. In this case, in a Rayleigh block fading channel, the optimal weight function ...

متن کامل

Matched Subspace Detectors for Stochastic Signals

Our aim in this paper is to extend the matched subspace detectors (MSDs) of [1–3] to the detection of stochastic signals. In [1–3] the signal to be detected was assumed to be placed deterministically at an unknown location in a known signal subspace. The basis for the subspace was irrelevant. In this paper the signal is assumed to be placed randomly at an unknown location in a known subspace. I...

متن کامل

SNR Maximization Hashing.dvi

We propose a novel robust hashing algorithm based on signal-to-noise ratio (SNR) maximization to learn compact binary codes, where the SNR metric is used to select a set of projection directions, and one hash bit is extracted from each projection direction. We first motivate this approach under a Gaussian model for the underlying signals, in which case maximizing SNR is equivalent to minimizing...

متن کامل

Matched subspace detectors

In this paper we formulate a general class of problems for detecting subspace signals in subspace interference and broadband noise. We derive the generalized likelihood ratio (GLR) for each problem in the class. We then establish the invariances for the GLR and argue that these are the natural invariances for the problem. In each case, the GLR is a maximal invariant statistic, and the distribut...

متن کامل

Tensor Matched Subspace Detection

The problem of testing whether an incomplete tensor lies in a given tensor subspace is significant when it is impossible to observe all entries of a tensor. We focus on this problem under tubal-sampling and elementwise-sampling. Different from the matrix case, our problem is much more challenging due to the curse of dimensionality and different definitions for tensor operators. In this paper, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2011

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2010.2102755